Preemptive and Non-Preemptive Real-Time Scheduling Based on Neural Networks
Identifieur interne : 00C516 ( Main/Exploration ); précédent : 00C515; suivant : 00C517Preemptive and Non-Preemptive Real-Time Scheduling Based on Neural Networks
Auteurs : C. Cardeira ; Z. MammeriSource :
English descriptors
- KwdEn :
Abstract
Artificial Neural Networks have already proved their usefulness in approximate solving, combinatorial optimization problems, and they have the advantage of reaching extremely rapid solution rates. This paper presents an ANN based approach to solve real-time tasks scheduling, and it shows that by a careful choice of an ANN topology, one can solve real-time tasks scheduling problems taking into account timing constraints (such as deadlines, earliest times, periods, maximum execution times), preemption and non-preemption of tasks in mono or multiprocessor architectures. ANN-based scheduling algorithms are not time-consuming so they can be used on-line in real-time systems contrary to most approximate techniques for problem solving.
Affiliations:
Links toward previous steps (curation, corpus...)
- to stream Crin, to step Corpus: 001938
- to stream Crin, to step Curation: 001938
- to stream Crin, to step Checkpoint: 002D28
- to stream Main, to step Merge: 00CD73
- to stream Main, to step Curation: 00C516
Le document en format XML
<record><TEI><teiHeader><fileDesc><titleStmt><title xml:lang="en" wicri:score="213">Preemptive and Non-Preemptive Real-Time Scheduling Based on Neural Networks</title></titleStmt><publicationStmt><idno type="RBID">CRIN:cardeira95c</idno><date when="1995" year="1995">1995</date><idno type="wicri:Area/Crin/Corpus">001938</idno><idno type="wicri:Area/Crin/Curation">001938</idno><idno type="wicri:explorRef" wicri:stream="Crin" wicri:step="Curation">001938</idno><idno type="wicri:Area/Crin/Checkpoint">002D28</idno><idno type="wicri:explorRef" wicri:stream="Crin" wicri:step="Checkpoint">002D28</idno><idno type="wicri:Area/Main/Merge">00CD73</idno><idno type="wicri:Area/Main/Curation">00C516</idno><idno type="wicri:Area/Main/Exploration">00C516</idno></publicationStmt><sourceDesc><biblStruct><analytic><title xml:lang="en">Preemptive and Non-Preemptive Real-Time Scheduling Based on Neural Networks</title><author><name sortKey="Cardeira, C" sort="Cardeira, C" uniqKey="Cardeira C" first="C." last="Cardeira">C. Cardeira</name></author><author><name sortKey="Mammeri, Z" sort="Mammeri, Z" uniqKey="Mammeri Z" first="Z." last="Mammeri">Z. Mammeri</name></author></analytic></biblStruct></sourceDesc></fileDesc><profileDesc><textClass><keywords scheme="KwdEn" xml:lang="en"><term>constraint satisfaction</term><term>multiprocessor</term><term>neural network</term><term>real-time scheduling algorithm</term><term>task</term></keywords></textClass></profileDesc></teiHeader><front><div type="abstract" xml:lang="en" wicri:score="2595">Artificial Neural Networks have already proved their usefulness in approximate solving, combinatorial optimization problems, and they have the advantage of reaching extremely rapid solution rates. This paper presents an ANN based approach to solve real-time tasks scheduling, and it shows that by a careful choice of an ANN topology, one can solve real-time tasks scheduling problems taking into account timing constraints (such as deadlines, earliest times, periods, maximum execution times), preemption and non-preemption of tasks in mono or multiprocessor architectures. ANN-based scheduling algorithms are not time-consuming so they can be used on-line in real-time systems contrary to most approximate techniques for problem solving.</div></front></TEI><affiliations><list></list><tree><noCountry><name sortKey="Cardeira, C" sort="Cardeira, C" uniqKey="Cardeira C" first="C." last="Cardeira">C. Cardeira</name><name sortKey="Mammeri, Z" sort="Mammeri, Z" uniqKey="Mammeri Z" first="Z." last="Mammeri">Z. Mammeri</name></noCountry></tree></affiliations></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/Main/Exploration
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 00C516 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Main/Exploration/biblio.hfd -nk 00C516 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Wicri/Lorraine
|area= InforLorV4
|flux= Main
|étape= Exploration
|type= RBID
|clé= CRIN:cardeira95c
|texte= Preemptive and Non-Preemptive Real-Time Scheduling Based on Neural Networks
}}
| This area was generated with Dilib version V0.6.33. |  |